This paper presents a novel Fuzzy Sarsa(λ) Learning (FSλL) approach applied to a strategic route leaning task of a mobile robot. FSλL is a hybrid architecture that combines Reinforcement Learning and Fuzzy Logic control. The Sarsa(λ) Learning algorithm is used to tune the rule-base of a Fuzzy Logic controller which has been tested in a route learning task. The robot explores its environment usi...

Elementary Affine Logic (EAL) is a variant of the Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assign to terms of λ-calculus EAL formulas as types. The problem is solved by showing that every λ-term which is typeable has a finite set of principal typing schemata, from which all and o...

We give a first-principles description of the context semantics of Gonthier, Abadi, and Lévy, a computer-science analogue of Girard’s geometry of interaction. We explain how this denotational semantics models λ-calculus, and more generally multiplicative-exponential linear logic (MELL), by explaining the call-by-name (CBN) coding of the λcalculus, and proving the correctness of readback, where ...

Elementary Affine Logic (EAL) is a variant of Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assigning to terms of λ-calculus EAL formulas as types. This problem, restricted to the propositional fragment of EAL, is proved to be decidable, and an algorithm is shown, building, for every ...

The logic $${\mathbb{L}}_\theta ^1$$ was introduced in [She12]; it is the maximal below $${{\mathbb{L}}_{\theta, \theta}}$$ which a well ordering not definable. We investigate for θ compact cardinal. prove that satisfies several parallels of classical theorems on first order logic, strengthening thesis natural logic. In particular, two models are -equivalent iff some ω-sequence θ-complete ultra...

The depletion of natural resources in the last century now threatens our planet and the life of future generations. For the sake of sustainable development, this paper pioneers an interesting and practical problem of dense substructure (i.e., maximal cliques) mining in a fuzzy graph where the edges are weighted by the degree of membership. For parameter 0 ≤ λ ≤ 1 (also called fuzzy cut in fuzzy...

We develop an efficient representation and a pre-unification algorithm in the style of Huet for the This extended abstract has been submitted to the Twelfth Annual Symposium on Logic in Computer Science LICS’97, Warsaw, Poland, June 29th – July 2nd 1997. linear λ-calculus λ→−◦&> which includes intuitionistic functions (→), linear functions (−◦), additive pairing (&), and additive unit (>). Appl...

It has been argued elsewhere that a logic programming language with function variables and λ-abstractions within terms makes a good meta-programming language, especially when an object-language contains notions of bound variables and scope. The λProlog logic programming language and the related Elf and Isabelle systems provide meta-programs with both function .variables and λ-abstractions by co...

Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...